Computable function

Results: 170



#Item
21THE WEAKNESS OF BEING COHESIVE, THIN OR FREE IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this pape

THE WEAKNESS OF BEING COHESIVE, THIN OR FREE IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this pape

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2016-02-08 07:56:59
22Ramsey-type graph coloring and diagonal non-computability Ludovic Patey Abstract A function is diagonally non-computable (d.n.c.) if it diagonalizes against the universal partial computable function. D.n.c. functions pla

Ramsey-type graph coloring and diagonal non-computability Ludovic Patey Abstract A function is diagonally non-computable (d.n.c.) if it diagonalizes against the universal partial computable function. D.n.c. functions pla

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2015-01-27 11:28:33
23Topics in the Theory and Practice of Computable Analysis Branimir Lambov PhD Dissertation

Topics in the Theory and Practice of Computable Analysis Branimir Lambov PhD Dissertation

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2006-06-09 09:40:53
24Computability Theory, Reverse Mathematics, and Ordered Fields Oscar Louis Levin, Ph.D. University of Connecticut, 2009

Computability Theory, Reverse Mathematics, and Ordered Fields Oscar Louis Levin, Ph.D. University of Connecticut, 2009

Add to Reading List

Source URL: www.math.uconn.edu

Language: English - Date: 2009-04-27 16:38:49
25˝ DOMINATING THE ERDOS-MOSER THEOREM IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. The Erd˝

˝ DOMINATING THE ERDOS-MOSER THEOREM IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. The Erd˝

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2015-05-13 11:24:44
26Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second,

Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second,

Add to Reading List

Source URL: www.scottaaronson.com

Language: English - Date: 2008-12-18 11:10:27
27A Lambda Calculus for Real Analysis Paul Taylor1 Andrej Bauer2  1 Department

A Lambda Calculus for Real Analysis Paul Taylor1 Andrej Bauer2 1 Department

Add to Reading List

Source URL: www.paultaylor.eu

Language: English - Date: 2009-02-12 12:32:31
28Indifferent sets Santiago Figueira∗ Joseph S. Miller†  Andr´e Nies‡

Indifferent sets Santiago Figueira∗ Joseph S. Miller† Andr´e Nies‡

Add to Reading List

Source URL: www.glyc.dc.uba.ar

Language: English - Date: 2009-01-20 10:12:05
29Computable Real Analysis without Set Theory or Turing Machines Paul Taylor Department of Computer Science University of Manchester UK EPSRC GR/S58522

Computable Real Analysis without Set Theory or Turing Machines Paul Taylor Department of Computer Science University of Manchester UK EPSRC GR/S58522

Add to Reading List

Source URL: www.paultaylor.eu

Language: English - Date: 2009-02-12 12:33:09
30Feasible analysis, randomness, and base invariance Santiago Figueira Andr´e Nies  March 26, 2014

Feasible analysis, randomness, and base invariance Santiago Figueira Andr´e Nies March 26, 2014

Add to Reading List

Source URL: www.glyc.dc.uba.ar

Language: English - Date: 2014-03-26 16:19:21